RALL: Machine-Supported Proofs for Relation Algebra
نویسندگان
چکیده
We present a theorem proving system for abstract relation algebra called RALL Relation Algebraic Language and Logic based on the generic theorem prover Isabelle On the one hand the system is an advanced case study for Isabelle HOL and on the other hand a quite mature proof assistant for research on the relational calculus RALL is able to deal with the full language of heterogeneous relation algebra including higher order operators and domain constructions and checks the type correctness of all formulas involved It o ers both an interac tive proof facility with special support for substitutions and estimations and an experimental automatic prover The automatic proof method ex ploits an isomorphism between relation algebraic and predicate logical formulas relying on the classical universal algebraic concepts of atom structures and complex algebras
منابع مشابه
Residuated Lattices
The theory of residuated lattices, first proposed by Ward and Dilworth [4], is formalised in Isabelle/HOL. This includes concepts of residuated functions; their adjoints and conjugates. It also contains necessary and sufficient conditions for the existence of these operations in an arbitrary lattice. The mathematical components for residuated lattices are linked to the AFP entry for relation al...
متن کاملExploring Social Robots as a tool for Special Education to teach English to Iranian Kids with Autism
This case study investigates the effects of Robot Assisted Language Learning (RALL) on English vocabulary learning and retention of Iranian children with high-functioning autism. Two groups of three male students (6-10 years old) with high-functioning autism participated in the current study. The humanoid robot NAO was used as a teacher assistant to teach English to the RALL group. Both RALL an...
متن کاملRelation Algebra
Tarski’s algebra of binary relations is formalised along the lines of the standard textbooks of Maddux and Schmidt and Ströhlein. This includes relation-algebraic concepts such as subidentities, vectors and a domain operation as well as various notions associated to functions. Relation algebras are also expanded by a reflexive transitive closure operation, and they are linked with Kleene algebr...
متن کاملDifferential Invariant Algebras of Lie Pseudo–Groups
The goal of this paper is to describe, in as much detail as possible, the structure of the algebra of differential invariants of a Lie pseudo-group. Under the assumption of local freeness of the prolonged pseudo-group action, we develop algorithms for locating a finite generating set of differential invariants, establishing the recurrence relations for the differentiated invariants, and fixing ...
متن کاملStone Relation Algebras
We develop Stone relation algebras, which generalise relation algebras by replacing the underlying Boolean algebra structure with a Stone algebra. We show that finite matrices over bounded linear orders form an instance. As a consequence, relation-algebraic concepts and methods can be used for reasoning about weighted graphs. We also develop a fixpoint calculus and apply it to compare different...
متن کامل